Applications of Constructive Logics in Analysis, Verification and Synthesis of Programs

نویسنده

  • Marco Benini
چکیده

These Lecture Notes describe the approach to the constructive analysis of computation as developed by Pierangelo Miglioli and his school. This Lecture Notes have been produced as the supporting material for the course in the Application of constructive logics to program analysis, synthesis and verification held in November 2006 at the Mathematisches Institut of the Ludwig Maximillians University in Munich (DE).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Formal Framework for Synthesis and Verification of Logic Programs

In this paper we will present a formal framework, based on the notion of extraction calculus, which has been successfully applied to define procedures for extracting information from constructive proofs. Here we will apply such a mechanism to give a proof-theoretic account of SLD-derivations. We show how proofs of suitable constructive systems can be used in the context of deductive synthesis o...

متن کامل

Competing Logics and Healthcare; Comment on “(Re) Making the Procrustean Bed? Standardization and Customization as Competing Logics in Healthcare”

This paper offers a short commentary on the editorial by Mannion and Exworthy. The paper highlights the positive insights offered by their analysis into the tensions between the competing institutional logics of standardization and customization in healthcare, in part manifested in the conflict between managers and professionals, and endorses the plea of the authors for further research in this...

متن کامل

Roland Backhouse : Relational Theory of Data Types 5 David Basin : Program Synthesis as Higher Order Resolution

Introduction 4 Roland Backhouse: Relational Theory of Data Types 5 David Basin: Program Synthesis as Higher Order Resolution 6 Bettina Buth: Verification Support for Compiler Development 7 Debora Weber-Wulff: Growing Programs from Proofs 8 Jacques Loeckx (with M. Wolf): Constructive versus axiomatic and initial specifications 9 Friederike Nickl: An Algebraic/Axiomatic Interpretation of Data Flo...

متن کامل

Divide and Conquer: the Quest for Compositional Design and Analysis (Dagstuhl Seminar 12511)

On December 16 to 21, the Dagstuhl seminar Divide and Conquer: the Quest for Compositional Design and Analysis was organized. Topic was the compositionality, a central theme in computer science, but its applications, methods, techniques are scattered around many different disciplines. Therefore, this workshop brought together scientists from different disciplines, including deductive verificati...

متن کامل

ProgrmaYerification in a l~gical Theory of Constructions

The logical theory of constructions is a simple theory which combines functional programs and intuitionistic predicate calculus. Here we propose that it is a practical alternative to other constructive programming logics, such as Martin-LSf's type theory. Its main advantage is that it admits reasoning directly about general recursion, while maintaining that all typed programs terminate. We illu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014